An inexact primal-dual path following algorithm for convex quadratic SDP

We propose primal-dual path-following Mehrotra-type predictor-corrector methods for solving convex quadratic semidefinite programming (QSDP) problems of the form: minX{2X • Q(X) + C • X : A(X) = b,X 0}, where Q is a self-adjoint positive semidefinite linear operator on Sn, b ∈ Rm, and A is a linear map from Sn to Rm. At each interior-point iteration, the search direction is computed from a dense symmetric indefinite linear system (called the augmented equation) with dimensionm+n(n+1)/2. Such linear systems are very large when n is larger than a few hundreds and can only be solved by iterative methods. We propose three classes of preconditioners for the augmented equation, and show that the corresponding preconditioned matrices have favorable asymptotic eigenvalue distributions for fast convergence under suitable nondegeneracy assumptions. We are able to solve the augmented equation efficiently via the preconditioned symmetric quasi-minimal residual iterative method with the preconditioners constructed. Numerical experiments on a variety of QSDPs with matrices of dimensions up to 1600 are performed and the computational results show that our methods are efficient and robust.